Program Transformation and Proof Transformation
نویسندگان
چکیده
A "linear style" sequent calculus makes it possible to explore the close structural relationships between primitive recursive programs and their inductive termination proofs, and between program transformations and their corresponding proof transformations. In this context the recursive to tail recursive transformation corresponds proof theoretically to a certain kind of cut elimination, called here "call by value cut elimination".
منابع مشابه
Design, implementation and evaluation of faculty empowerment program in the field of virtual education the document the transformation and innovation of Medical education an application of the Harden curriculum planning model
This article has no abstract.
متن کاملISOLATION AND STRUCTURAL ELUCIDATION OF THE FIRST KNOWN C-HOMOPROTOBERBERINE
A novel C-homoprotoberberine alkaloid, Hediamine (2), has been isolated from the roots of Berberis actinucantha (Berberidaceae). Conclusive proof for the structure of hediamine was obtained by its comparison with the isomeric lactam (4), by chemical transformation, and by means of spectroscopic techniques (UV, IR, MS, NMR).
متن کاملSimulation of Ideal External and Internal Flows with Arbitrary Boundaries Using Schwarz Christoffel Transformation
The flow field, velocity and pressure coefficient distribution of some 2-D ideal flows are presented. Conformal mapping is used to simulate two-dimensional ideal flow for a variety of complex internal and external configurations, based on the numerical integration of Schwarz-Christoffel transformation. The advantages of this method are simplicity and high accuracy. The method presented in this ...
متن کاملTowards a Logic for Reasoning About Logic Programs Transformation
We give a proof-theoretic analysis of logic programs transformations , viewed as operations on proof trees in the sense of 3, 4, 9, 10]. We present a logic for reasoning about (equivalence preserving) transformations of logic programs. Our main tool is the usage of inference rules; the target program may be obtained as a set of clause introduction proofs with axioms from the source program. The...
متن کاملProving Theorems by Program Transformation
In this paper we present an overview of the unfold/fold proof method, a method for proving theorems about programs, based on program transformation. As a metalanguage for specifying programs and program properties we adopt constraint logic programming (CLP), and we present a set of transformation rules (including the familiar unfolding and folding rules) which preserve the semantics of CLP prog...
متن کامل